//
// Created by moonlight on 25-7-21.
//
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;

void TestQueue() {
    queue<int> q;
    for (int i = 0; i < 10; i++) {
        q.push(i);
    }
    for (int i = 0; i < 10; i++) {
        cout <<"空间: "<< q.size() << "\t";
        cout <<"出队: "<< q.front() <<" ";
        q.pop();
        if (q.empty()) {
            cout << "->队列为空" << endl;
        }
        cout <<endl;
    }
}
int main() {
    TestQueue();
    return 0;
}